Geometric Partitioning
نویسنده
چکیده
The well-known Ham Sandwich Theorem says that given d nice sets in R, there exists a hyperplane that splits each of them into two parts of equal measure. When the sets are finite, there is the computational problem of finding such a plane. This is a starting point for other facts about when, and how various sets can or cannot be split in various ways. Several old and new geometric partitioning results of this kind will be discussed.
منابع مشابه
A Data-Parallel Implementation of the Geometric Partitioning Algorithm
We present a data-parallel, High Performance Fortran (HPF) implementation of the geometric partitioning algorithm. The geometric partitioning algorithm has provably good partitioning quality. To our knowledge, our implementation is the rst data{parallel implementation of the algorithm. Our data{parallel formulation makes extensive use of segmented preex sums and parallel selections, and provide...
متن کاملGeometric Crossovers for Multiway Graph Partitioning
Geometric crossover is a representation-independent generalization of the traditional crossover defined using the distance of the solution space. By choosing a distance firmly rooted in the syntax of the solution representation as a basis for geometric crossover, one can design new crossovers for any representation. Using a distance tailored to the problem at hand, the formal definition of geom...
متن کاملMultiway partitioning via geometric embeddings, orderings, and dynamic programming
AbstructThis paper presents effective algorithms for multiway partitioning. Confirming ideas originally due to Hall, we demonstrate that geometric embeddings of the circuit netlist can lead to high-quality k-way partitionings. The netlist embeddings are derived via the computation of d eigenvectors of the Laplacian for a graph representation of the netlist. As Hall did not specify how to partit...
متن کاملBinary Space Partitioning and Sparse Geometric Wavelets Representation for Image Compression
For low bit-rate compression applications, segmentation-based coding methods provide, in general, high compression ratios when compared with traditional (e.g., transform and subband) coding approaches. In this paper, we present a segmentation based image coding method that divides the desired image using binary space partitioning (BSP). Geometric wavelet is a recent development in the field of ...
متن کاملGeometric Spectral Partitioning
We investigate a new method for partitioning a graph into two equal-sized pieces with few connecting edges. We combine ideas from two recently suggested partitioning algorithms, spectral bisection (which uses an eigenvector of a matrix associated with the graph) and geometric bisection (which applies to graphs that are meshes in Euclidean space). The new method does not require geometric coordi...
متن کاملA self-organizing geometric algorithm for autonomous data partitioning
A model of a geometric algorithm is introduced and methodology of its operation is presented for the dynamic partitioning of data spaces.
متن کامل